Lower Bounds for the Uncapacitated Facility Location Problem with User Preferences

نویسندگان

  • PIERRE HANSEN
  • YURI KOCHETOV
  • NENAD MLADENOVIĆ
چکیده

We consider the bilevel uncapacitated facility location problem with user preferences. It is known that this model may be reformulated as a one-level location problem with some additional constraints. In this paper we introduce a new reformulation and show that this reformulation dominates three previous ones from the point of view of their linear programming relaxations and may be worse than a reduction to the row selection problem for pairs of matrices. However, this last reduction requires many additional variables and constraints. Computational experiments on random data instances shows that the new reformulation allows to find an optimal solution of the bilevel location problem considered faster than all previous approaches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cuckoo search via Levy flights applied to uncapacitated facility location problem

Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take s...

متن کامل

A Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers

The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...

متن کامل

A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints

We consider the two-level uncapacitated facility location problem with singleassignment constraints (TUFLP-S), a problem that arises in industrial applications in freight transportation and telecommunications. We present a new Lagrangian relaxation approach for the TUFLP-S, based on solving a single-level uncapacitated facility location problem (UFLP) as the Lagrangian subproblem. We also devel...

متن کامل

A Facility Location Problem with Tchebychev Distance in the Presence of a Probabilistic Line Barrier

This paper considers the Tchebychev distance for a facility location problem with a probabilistic line barrier in the plane. In particular, we develop a mixed-integer nonlinear programming (MINLP) model for this problem that minimizes the total Tchebychev distance between a new facility and the existing facilities. A numerical example is solved to show the validity of the developed model. Becau...

متن کامل

On the Power of Priority Algorithms for Facility Location and Set Cover

We apply and extend the priority algorithm framework introduced by Borodin, Nielsen and Rackoo to deene \greedy-like" algorithms for (uncapacitated) facility location problems and set cover. These problems have been the focus of extensive research from the point of view of approximation algorithms, and for both problems, greedy algorithms have been proposed and analyzed. The priority algorithm ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004